Sequencing certain dihedral groups

Dihedral Groups

Sumsets in dihedral groups

Let Dn be the dihedral group of order 2n. For all integers r, s such that 1 ≤ r, s ≤ 2n, we give an explicit upper bound for the minimal size μDn (r, s) = min |A · B| of sumsets (product sets) A · B, where A and B range over all subsets of Dn of cardinality r and s respectively. It is shown by construction that μDn (r, s) is bounded above by the known value of μG (r, s), where G is any abelian ...

Calculations of Dihedral Groups Using Circular Indexation

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and g...

Limits of Dihedral Groups

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

Dihedral Groups Ii

1. Abstract characterization of Dn The group Dn has two generators r and s with orders n and 2 such that srs−1 = r−1. We will show any group with a pair of generators like r and s (except for their order) admits a homomorphism onto it from Dn, and is isomorphic to Dn if it has the same size as Dn. Theorem 1.1. Let G be generated by elements a and b where an = 1 for some n ≥ 3, b2 = 1, and bab−1...